Performance-complexity of Coded Spatial Modulation Systems

In this contribution, performance analysis on MIMO spatial modulation (SM) with low-density parity-check coding (LDPC) is developed. Specific coding rate is combined with different spatial modulation order; as a result, a framework including performance, complexity, attainable diversity order trade-off for spatial modulation technique based on simulation results is provided and compared with conventional quasiorthogonal space-time block code (QO-STBC) system and reduced cluster search in maximum likelihood decoding (RCSML) MIMO scheme as well. The numerical results show that although the SM principle with soft decision LDPC coding achieves good performance, diversity order and a certain robustness to channel coefficient errors, the best performancecomplexity tradeoff is attainable with RCS-ML scheme. Furthermore, performance-complexity analysis covering uncoded SM with ML hard decision configurations with different number of mapping bits is established.